Set-syllogistics meet combinatorics
نویسندگان
چکیده
منابع مشابه
Set-syllogistics meet combinatorics
Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu 1 Dipartimento di Matematica e Geoscienze, Università di Trieste, Via Valerio 12/1, I-34127 – Trieste, Italy. email: [email protected] 2 Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, I-33100 – Udine, Italy. email: [email protected] 3 Helsinki Institute for Information Technology HIIT, Depa...
متن کاملCombinatorics of Fulton's Essential Set
Fulton introduced the essential set of a permutation, together with a rank function. In this paper we study some combinatorial aspects of the essential set: We present an algorithm that retrieves a permutation from its ranked essential set. Thereby we can characterize the class of ranked sets that arise as ranked essential sets of permutations, answering a question of Fulton. Several classes of...
متن کاملAutomata in SageMath - Combinatorics meet Theoretical Computer Science
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved using SageMath. In particular, we compute the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before.
متن کاملMore Combinatorics of Fulton’s Essential Set
Abstract We develop combinatorics of Fulton’s essential set particularly with a connection to Baxter permutations. For this purpose, we introduce a new idea: dual essential sets. Together with the original essential set, we reinterpret Eriksson-Linusson’s characterization of Baxter permutations in terms of colored diagrams on a square board. We also discuss a combinatorial structure on local mo...
متن کاملSyllogistics = Monotonicity + Symmetry + Existential Import
Syllogistics reduces to only two rules of inference: monotonicity and symmetry, plus a third if one wants to take existential import into account. We give an implementation that uses only the monotonicity and symmetry rules, with an addendum for the treatment of existential import. Soundness follows from the monotonicity properties and symmetry properties of the Aristotelean quantifiers, while ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2015
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129515000122